Allocation rules for multi-choice games with a permission tree structure

نویسندگان

چکیده

We consider multi-choice cooperative games with a permission tree structure. Multi-choice are generalization of transferable utility in which each player has several activity levels. In addition, structure models situation needs from another to cooperate. this framework, the influence on possibility cooperation may have interpretations depending context. paper, we investigate these and introduce for them new allocation rule that axiomatically characterize.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Average Tree Permission Value for Games with a Permission Tree

In the literature various models of games with restricted cooperation can be found. In those models, instead of allowing for all subsets of the set of players to form, it is assumed that the set of feasible coalitions is a proper subset of the power set of the set of players. In this paper we consider such sets of feasible coalitions that follow from a permission structure on the set of players...

متن کامل

Allocation rules for network games

Previous allocation rules for network games, such as the Myerson Value, implicitly or explicitly take the network structure as fixed. In many situations, however, the network structure can be altered by players. This means that the value of alternative network structures (not just sub-networks) can and should influence the allocation of value among players on any given network structure. I pres...

متن کامل

The average tree solution for multi-choice forest games

In this article we study cooperative multi-choice games with limited cooperation possibilities, represented by an undirected forest on the player set. Players in the game can cooperate if they are connected in the forest. We introduce a new (single-valued) solution concept which is a generalization of the average tree solution defined and characterized by Herings et al. [2008] for TU-games play...

متن کامل

Axiomatizations of Banzhaf permission values for games with a permission structure

In games with a permission structure it is assumed that players in a cooperative transferable utility game are hierarchically ordered in the sense that there are players that need permission from other players before they are allowed to cooperate. We provide axiomatic characterizations of Banzhaf permission values being solutions that are obtained by applying the Banzhaf value to modified TU-ga...

متن کامل

Games with fuzzy permission structure: A conjunctive approach

A cooperative game consists of a set of players and a characteristic function which determines the maximal gain or minimal cost that every subset of players can achieve when they decide to cooperate, regardless of the actions that the other players take. A permission structure over the set of players describes a hierarchical organization where there are players who need permission from certain ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Operations Research

سال: 2022

ISSN: ['1572-9338', '0254-5330']

DOI: https://doi.org/10.1007/s10479-022-04953-4